A Measure of Shape Dissimilarity for 3D Curves

نویسندگان

  • Ernesto Bribiesca
  • Wendy Aguilar
چکیده

We present a quantitative approach to the measurement of shape dissimilarity between two 3D (three-dimensional) curves. Any 3D continuous curve can be digitalized and represented as a 3D discrete curve. Thus, a 3D discrete curve is composed of constant orthogonal straightline segments. In order to represent 3D discrete curves, we use the orthogonal direction change chain code. The chain elements represent the orthogonal direction changes of the contiguous straight-line segments of the discrete curve. This chain code only considers relative direction changes, which allows us to have a curve descriptor invariant under translation and rotation. Also, this curve descriptor may be starting point normalized and mirroring curves may be obtained with ease. Thus, using the above-mentioned chain code it is possible to have a unique 3D-curve descriptor. To find out how close in shape two 3D curves are, a measure of shapeof-curve dissimilarity between them is introduced; analogous curves will have a low measure of shape dissimilarity, while different curves will have a high measure of shape dissimilarity. When this measure of shape dissimilarity is normalized, its values vary continuously from 0 to 1. If Author to whom correspondence should be addressed 728 E. Bribiesca and W. Aguilar two curves are identical, the value of the measure of shape dissimilarity is equal to 0. The computation of this measure for two curves is based on the analysis of their common and different subcurves represented by their chain elements. Finally, we present some results of the computation of the proposed measure for 15 curves. Mathematics Subject Classification: 65D17

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A texture-based interpretation workflow with application to delineating salt domes

In this paper, we propose a texture-based interpretation workflow and apply to delineate salt domes in 3D migrated seismic volumes. First, we compute an attribute map using a novel seismic attribute, three-dimensional gradient of textures (3D-GoT), which measures the dissimilarity between neighboring cubes around each voxel in seismic volume across time or depth, crossline, and inline direction...

متن کامل

Efficient Measurement of Shape Dissimilarity between 3D Models Using Z-Buffer and Surface Roving Method

Estimation of the shape dissimilarity between 3D models is a very important problem in both computer vision and graphics for 3D surface reconstruction, modeling, matching, and compression. In this paper, we propose a novel method called surface roving technique to estimate the shape dissimilarity between 3D models. Unlike conventional methods, our surface roving approach exploits a virtual came...

متن کامل

Geodesic Object Representation and Recognition

This paper describes a shape signature that captures the intrinsic geometric structure of 3D objects. The primary motivation of the proposed approach is to encode a 3D shape into a one-dimensional geodesic distribution function. This compact and computationally simple representation is based on a global geodesic distance defined on the object surface, and takes the form of a kernel density esti...

متن کامل

Optimized Conformal Parameterization of Cortical Surfaces Using Shape Based Matching of Landmark Curves

In this work, we find meaningful parameterizations of cortical surfaces utilizing prior anatomical information in the form of anatomical landmarks (sulci curves) on the surfaces. Specifically we generate close to conformal parametrizations that also give a shape-based correspondence between the landmark curves. We propose a variational energy that measures the harmonic energy of the parameteriz...

متن کامل

Contour-Based Shape Retrieval Using Dynamic Time Warping

A dissimilarity measure for shapes described by their contour, the Cyclic Dynamic Time Warping (CDTW) dissimilarity, is introduced. The dissimilarity measure is based on Dynamic Time Warping of cyclic strings, i.e., strings with no definite starting/ending points. The Cyclic Edit Distance algorithm by Maes cannot be directly extended to compute the CDTW dissimilarity, as we show in the paper. W...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006